Combinatorial Structures in Loops I. Elements of the Decomposition Theory

Difference sets have been extensively studied in groups, principally in Abelian groups. Here we extend the notion of a difference set to loops. This entails considering the class of principal block partial designs (PBPDs) and (v, k, A) designs. By means of a certain permutation matrix decomposition of the incidence matrices of a system and its complement, we can isomorphically identify an abstract system with a corresponding system in a loop. Special properties of this decomposition correspond to special algebraic properties of the loop. Here we investigate the situation when some or all of the elements of the loop are right inversive. We identify certain classes of (v, k, X) designs, including skewHadamard designs and finite projective planes, with designs and difference sets in right inverse property loops and prove a universal existence theorem for PBPDs and corresponding difference sets in such loops.